The Largest Component in a Subcritical Random Graph with a Power Law Degree Distribution by Svante Janson
نویسنده
چکیده
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent γ > 3, the largest component is of order n1/(γ−1). More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distributions. This proves a conjecture by Durrett.
منابع مشابه
The Largest Component in a Subcritical Random Graph with a Power Law Degree Distribution
It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent γ > 3, the largest component is of order n. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distrib...
متن کاملOn the Largest Component of a Random Graph with a Subpower-law Degree Sequence in a Subcritical Phase
A uniformly random graph on n vertices with a fixed degree sequence, obeying a γ subpower law, is studied. It is shown that, for γ > 3, in a subcritical phase with high probability the largest component size does not exceed nn , εn =O(ln lnn/ lnn), 1/γ being the best power for this random graph. This is similar to the best possible n bound for a different model of the random graph, one with ind...
متن کاملSusceptibility in subcritical random graphs
We study the evolution of the susceptibility in the subcritical random graph G n , p as n tends to infinity. We obtain precise asymptotics of its expectation and variance and show that it obeys a law of large numbers. We also prove that the scaled fluctuations of the susceptibility around its deterministic limit converge to a Gaussian law. We further extend our results to higher moments of the ...
متن کاملSusceptibility of Random Graphs with given Vertex Degrees
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In the supercritical case, a corresponding result holds for the modified susceptibility ignoring the giant component and the expected size of a finite cluster ...
متن کاملLarge Cliques in a Power-law Random Graph
We study the size of the largest clique ω(G(n, α)) in a random graphG(n, α) on n vertices which has power-law degree distribution with exponent α. We show that for ‘flat’ degree sequences with α > 2 whp the largest clique in G(n, α) is of a constant size, while for the heavy tail distribution, when 0 < α < 2, ω(G(n, α)) grows as a power of n. Moreover, we show that a natural simple algorithm wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008